THE SATELLITE STRUCTURE TOPOLOGY OPTIMIZATION BASED ON HOMOGENIZATION METHOD AND ITS SIZE SENSITIVITY ANALYSIS

With the development of satellite structure technology, more and more design parameters will affect its structural performance. It is desirable to obtain an optimal structure design with a minimum weight, including optimal configuration and sizes. The present paper aims to describe an optimization analysis for a satellite structure, including topology optimization and size optimization. Based on the homogenization method, the topology optimization is carried out for the main supporting frame of service module under given constraints and load conditions, and then the sensitivity analysis is made of 15 structural size parameters of the whole satellite and the optimal sizes are obtained. The numerical result shows that the present optimization design method is very effective.     

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.     

The Levels-Recursive Algorithm for Vector Valued Interpolants by Triple Branched Continued Fractions

1 Introduction Let Πl,m,n be a set of points in three dimensional space R3, Πl,m,n = {(xi, yj, zk), i = 0, 1, · · · l; j = 0, 1, · · · m; k = 0, 1, · · · n}. Let a d?dimensional vector vi,j,k be given at every point (xi, yj, zk) ∈ Πl,m,n and     

非线性约束优化问题的一个修正 Lagrangian 算法

基于一个含有控制参数的修正Lagrangian函数,该文建立了一个求解非线性约束优化问题的修正Lagrangian算法.在一些适当的条件下,证明了控制参数存在一个阀值,当控制参数小于这一阀值时,由这一算法产生的序列解局部收敛于问题的Kuhn-Tucker点,并且建立了解的误差上界.最后给出一些约束优化问题的数值结果.     

Stress-based upper-bound method and convex optimization: case of the Gurson materialMéthode cinématique par les contraintes et optimisation convexe : cas du matériau de Gurson

A nonlinear interior point method associated with the kinematic theorem of limit analysis is proposed. Associating these two tools enables one to determine an upper bound of the limit loading of a Gurson material structure from the knowledge of the sole yield criterion. We present the main features of the interior point algorithm and an original method providing a rigorous kinematic bound from a stress formulation of the problem. This method is tested by solving in plane strain the problem of a Gurson infinite bar compressed between rough rigid plates. To cite this article: F. Pastor et al., C. R. Mecanique 334 (2006).     

下层带扰动参数的二层多目标最优化问题有效点集的锥次微分稳定性

关于集值映射最优化问题有效点集的稳定性问题，一些学者在半连续意义下得到比较系统的结果。近年，在锥次微分意义下又获得更深入的描述。借助集值映射最优化问题有效解(点)的锥次微分稳定性理论，讨论了上层无扰动，下层带扰动参数的二层多目标最优化问题有效点集的锥次微分稳定性。     

Vector Ordinal Optimization

Ordinal optimization is a tool to reduce the computational burden in simulation-based optimization problems. So far, the major effort in this field focuses on single-objective optimization. In this paper, we extend this to multiobjective optimization and develop vector ordinal optimization, which is different from the one introduced in Ref. 1. Alignment probability and ordered performance curve (OPC) are redefined for multiobjective optimization. Our results lead to quantifiable subset selection sizes in the multiobjective case, which supplies guidance in solving practical problems, as demonstrated by the examples in this paper.This paper was supported in part by Army Contract DAAD19-01-1-0610, AFOSR Contract F49620-01-1-0288, and a contract with United Technology Research Center (UTRC). The first author received additional funding from NSF of China Grants 60074012 and 60274011, Ministry of Education (China), and a Tsinghua University (Beijing, China) Fundamental Research Funding Grant, and the NCET program of China.The authors are grateful to and benefited from two rounds of reviews from three anonymous referees.     

基于有限元仿真的东风11型救援小车支撑块结构优化

对东风11型救援小车支撑件进行了有限元分析．通过有限元计算。详细分析了有效应力分布情况；找出了应力集中较大的区域．并分析了其主要原因；观察了应力值最大区域并提出了改善应力集中的方法和措施。从而达到了结构优化的目的．     

Optimal Release Times in Single-Stage Manufacturing Systems with Blocking: Optimal Control Perspective

This paper concerns a due-date matching problem in a single-stage manufacturing system. Given a finite sequence of jobs and their service order, and given the delivery due date of each job, the problem is to choose the jobs release (arrival) times so as to match as closely as possible their completion times to their respective due dates. The system is modelled as a deterministic single-server FIFO queue with an output buffer for storing jobs whose service is completed prior to their due dates. The output buffer has a finite capacity; when it is full, the server is being blocked. Associated with each job there is a convex cost function penalizing its earliness as well as tardiness. The due-date matching problem is cast as an optimal control problem, whose objective is to minimize the sum of the above cost functions by the choice of the jobs arrival (release) times. Time-box upper-bound and lower-bound constraints are imposed on the jobs output (delivery) times. The optimal-control setting brings to bear on the development of fast and efficient algorithms having intuitive geometric appeal and potential for online implementation.Communicated by W. B. GongResearch supported in part by the National Science Foundation under Grant ECS-9979693 and by the Georgia Tech Manufacturing Research Center under Grant B01-D06.     

Contractibility of the Solution Sets in Strictly Quasiconcave Vector Maximization on Noncompact Domains

We study the contractibility of the efficient solution set of strictly quasiconcave vector maximization problems on (possibly) noncompact feasible domains. It is proved that the efficient solution set is contractible if at least one of the objective functions is strongly quasiconcave and any intersection of level sets of the objective functions is a compact (possibly empty) set. This theorem generalizes the main result of Benoist (Ref.1), which was established for problems on compact feasible domains.The authors thank Dr. T. D. Phuong, Dr. T. X. D. Ha, and the referees for helpful comments and suggestions.